class Solution {
public:
    bool doesAliceWin(string s) {
        
        unordered_set<char> has;
        has.insert('a'),has.insert('e'),has.insert('i'),has.insert('o'),has.insert('u');
        for(int i=0;i<s.size();++i){
            if(has.count(s[i])){
                return true;
            }
        }

        return false;
    }
};
